Advances in CAD/CAM/CAE Technologies

CAD/CAM/CAE technologies find more and more applications in today’s industries, e.g., in the automotive, aerospace, and naval sectors. These technologies increase the productivity of engineers and researchers to a great extent, while at the same time allowing their research activities to achieve higher levels of performance. A number of difficult-to-perform design and manufacturing processes can be simulated using more methodologies available, i.e., experimental work combined with statistical tools (regression analysis, analysis of variance, Taguchi methodology, deep learning), finite element analysis applied early enough at the design cycle, CAD-based tools for design optimizations, CAM-based tools for machining optimizations

A Brief Review of Computational Product Design: A Brand Identity Approach

On the way to designing customized products as one of the core activities of Industry 4.0, the strategy of computational design emerges as a unique design process due to its flexibility and simplicity. More specifically, the aforementioned strategy is concerned with the study of brand identity and its description in the development of commercial industrial products. The proposed design approach is focused on the study of branded product forms following computational design methodologies, i.e., employing textual or/and visual programming languages. The paper presents an overview of in-depth research studies which deal with the systematic way of creation, evolution, and transformation of industrial products with modern digital tools. Through the review, 100 studies have been analyzed over the last 15 years. The background of this research includes definitions from the specific four pillars of the modern theory of industrial design, e.g., product design, digital design, visual representation, and product identity. Furthermore, the current paper combines the use of computational design with specific parameters of visual brand elements in order to develop a methodological tool for the mass customization of industrial products. Moreover, the proposed framework offers a great deal of flexibility in both design and manufacturing, while many design alternatives could become available in a very short time. Finally, the impact of this paper is the correlation between computational design techniques and the theoretical background of brand identity principles (i.e., shapes, geometries, styles, textures, colors, and materials) for inspiring novel ideas among engineers, designers, and marketers

On the Edge Label Placement Problem

. Let G(V;E) be a graph, and let f : G ! R 2 be a one to one function that produces a layout of a graph G on the plane. We consider the problem of assigning text labels to every edge of the graph such that the quality of the labeling assignment is optimal. This problem has been first encountered in automated cartography and has been referred to as the Line Feature Label Placement (LFLP) problem. Even though much effort has been devoted over the last 15 years in the area of automated drawing of maps, the Edge Label Placement (ELP) problem has received little attention. In this paper we investigate computational complexity issues of the ELP problem, which have been open up to the present time. Specifically we prove that the ELP problem is NP-Hard. 1 Introduction In recent years graph drawing has received increasing attention due to the large number of applications, such as, entity relationship diagrams, software engineering diagrams, CASE tools, debugging tools, communication network..

Modifying Orthogonal Drawings for Label Placement

In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing). We investigate computational complexity issues of variations of that problem, and we present polynomial time algorithms that find the minimum increase of space in one direction, needed to resolve overlaps, while preserving the orthogonal representation of the orthogonal drawing when objects have a predefined partial order

Placing Edge Labels by Modifying an Orthogonal Graph Drawing

In this paper we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost. We present a polynomial time algorithm that finds the minimum increase of space in one direction, needed to resolve overlaps, while preserving the orthogonal representation of the drawing

A Brief Review of Computational Product Design: A Brand Identity Approach

On the way to designing customized products as one of the core activities of Industry 4.0, the strategy of computational design emerges as a unique design process due to its flexibility and simplicity. More specifically, the aforementioned strategy is concerned with the study of brand identity and its description in the development of commercial industrial products. The proposed design approach is focused on the study of branded product forms following computational design methodologies, i.e., employing textual or/and visual programming languages. The paper presents an overview of in-depth research studies which deal with the systematic way of creation, evolution, and transformation of industrial products with modern digital tools. Through the review, 100 studies have been analyzed over the last 15 years. The background of this research includes definitions from the specific four pillars of the modern theory of industrial design, e.g., product design, digital design, visual representation, and product identity. Furthermore, the current paper combines the use of computational design with specific parameters of visual brand elements in order to develop a methodological tool for the mass customization of industrial products. Moreover, the proposed framework offers a great deal of flexibility in both design and manufacturing, while many design alternatives could become available in a very short time. Finally, the impact of this paper is the correlation between computational design techniques and the theoretical background of brand identity principles (i.e., shapes, geometries, styles, textures, colors, and materials) for inspiring novel ideas among engineers, designers, and marketers

On the Edge Label Placement Problem

Let G(V,E) be a graph, and let f:G->R² be a one to one function that produces a layout of a graph G on the plane. We consider the problem of assigning text labels to every edge of the graph such that the quality of the labeling assignment is optimal. This problem has been first encountered in automated cartography and has been refferedto as the Line Feature Label Placement (LFLP) problem. Even though much effort has been devoted over the last 15 years in the area of automated drawing of maps, the Edge Label Placement (ELP) problem has received little attention. In this paper we investigate computational complexity issues of the ELP problem, which have been open up to the present time. Specifically we prove that the ELP problem is NP-Hard

On the Multiple Label Placement Problem

We consider the problem of positioning text or symbol labels associated with graphical features of two dimensional maps (geographical or technical) or drawings. In many practical applications, it is often the case, that each graphical feature has more than one label. This variation of the labeling problem has not been addressed in depth. In this paper we introduce techniques that solve this problem. We have applied these techniques to drawings of graphs, and we present very encouraging experimental results

An Algorithm for Labeling Edges of Hierarchical Drawings

. Let G(V;E) be a graph, and let \Gamma be the drawing of G on the plane. We consider the problem of assigning text labels to every edge of G such that the quality of the label assignment is optimal. This problem has been first encountered in automated cartography. Even though much effort has been devoted over the last 15 years in the area of automated drawing of maps, the Edge Label Placement (ELP) problem remains essentially unsolved. In this paper we investigate the ELP problem. We present an algorithm for the ELP problem more suitable for hierarchical drawings of graphs, but it can be adopted to many different drawing styles and still remain effective. Also, we present experimental results of our algorithm that indicate its effectiveness. 1 Introduction The area of graph drawing has grown significantly in the recent years motivated mostly by applications in information visualization [4, 17]. When visualizing information, it is essential to display not only the structure of the ob..